Spectral distances on graphs
نویسندگان
چکیده
منابع مشابه
Spectral Distances of Graphs Based on their Different Matrix Representations
The investigation of the spectral distances of graphs that started in [3] (I. Jovanović, Z. Stanić, Spectral distances of graphs, Linear Algebra Appl., 436 (2012) 1425–1435.) is continued by defining Laplacian and signless Laplacian spectral distances and considering their relations to the spectral distances based on the adjacency matrix of graph. Some separate results concerning the defined di...
متن کاملEuclidean Distances, Soft and Spectral Clustering on Weighted Graphs
We define a class of Euclidean distances on weighted graphs, enabling to perform thermodynamic soft graph clustering. The class can be constructed form the “raw coordinates” encountered in spectral clustering, and can be extended by means of higher-dimensional embeddings (Schoenberg transformations). Geographical flow data, properly conditioned, illustrate the procedure as well as visualization...
متن کاملon the skew spectral moments of graphs
let $g$ be a simple graph, and $g^{sigma}$ be an oriented graph of $g$ with the orientation $sigma$ and skew-adjacency matrix $s(g^{sigma})$. the $k-$th skew spectral moment of $g^{sigma}$, denoted by $t_k(g^{sigma})$, is defined as $sum_{i=1}^{n}( lambda_{i})^{k}$, where $lambda_{1}, lambda_{2},cdots, lambda_{n}$ are the eigenvalues of $g^{sigma}$. suppose $g^{sigma...
متن کاملOn strong distances in oriented graphs
Let D be a strongly connected digraph. The strong distance between two vertices u and v in D, denoted by sdD(u; v) is the minimum size of a strongly connected subdigraph of D containing u and v. The strong eccentricity, se(u), of a vertex u of D, is the strong distance between u and a vertex farthest from u. The minimum strong eccentricity among the vertices of D is the strong radius, srad(D), ...
متن کاملOn Distances between Isomorphism Classes of Graphs
Various measures of distance between (the isomorphism classes of) two graphs have been proposed. These include measures proposed by Zelinka [6],[7], Baláž, Koča, Kvasńıčka & Sekanina [1] and Johnson [4]. Further, there is the edge rotation distance of Chartrand, Saba & Zou [3] and the edge shift distance of Johnson [5]. It is on the latter two that we build. For terminology and notation not exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.04.011